-
1 vertex-connected graph
Большой англо-русский и русско-английский словарь > vertex-connected graph
-
2 vertex-connected graph
Математика: вершинно связный графУниверсальный англо-русский словарь > vertex-connected graph
-
3 vertex-connected graph
English-Russian scientific dictionary > vertex-connected graph
-
4 l-vertex connected graph
1) Электроника: л-вершинно-связный граф2) Макаров: l-вершинно-связный графУниверсальный англо-русский словарь > l-vertex connected graph
-
5 l-vertex connected graph
English-Russian electronics dictionary > l-vertex connected graph
-
6 l-vertex connected graph
The New English-Russian Dictionary of Radio-electronics > l-vertex connected graph
-
7 connected graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
8 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
9 graph
1) граф2) график; кривая || строить график; вычерчивать кривую3) диаграмма || представлять в виде диаграммы4) вчт моносимвольная графема, граф•- graph of strictly partial order
- acyclic graph
- alternating graph
- alternating-composition graph
- animated bar graph
- area graph
- associated undirected graph
- atomic graph
- attachment graph
- balanced signed graph
- bar graph
- basis graph
- bicolorable graph
- bicolored graph
- bipartite graph
- block graph
- bunch graph
- Cayley's graph
- circuit closed graph
- circuit connected graph
- circuit-free graph
- clique graph
- color graph
- colored graph
- column graph
- columnar graph
- communication graph
- complete graph
- connected graph
- converse graph
- coordinate graph
- critical graph
- current graph
- cyclic graph
- data flow graph
- Desargues' graph
- descendence graph
- directed graph
- dual Y-axis graph
- Euler graph
- Eulerian graph
- even graph
- exclusion graph
- exploded pie graph
- finite graph
- flat graph
- fractal graph
- function graph
- fuzzy graph
- general graph
- graceful graph
- Hamilton graph
- Hamiltonian graph
- high/low/close/open graph
- HLCO graph
- horizontal bar graph
- identity graph
- implication graph
- infinite graph
- interaction graph
- interchange graph
- interval graph
- isomorphic graph
- k-chromatic graph
- k-colorable graph
- k-edge connected graph
- knot graph
- labeled graph
- labeled semantic graph
- levelized graph
- line graph
- linked pie-column graph
- line-symmetric graph
- lobe graph
- locally finite graph
- locally restricted graph
- logarithmic graph
- l-vertex connected graph
- maximal strongly singular graph
- mixed graph
- mixed column/line graph
- m-partite graph
- multidimensional graph
- mutually connected graph
- net graph
- network graph
- nonseparable graph
- numbered undirected graph
- one hundred percent column graph
- one-way graph
- operator graph
- oriented graph
- paired bar graph
- paired pie graph
- Pappus' graph
- Petersen graph
- phonetic graph
- picture graph
- pie graph
- planar graph
- plane graph
- point-symmetric graph
- proportional pie graph
- R-graph
- recursively structured graph
- reduced-flow graph
- region adjacency graph
- regular graph of degree n
- reproduction graph
- rigid circuit graph
- rooted graph
- scatter graph
- sectional graph
- self-complementary graph
- selt-negational signed graph
- semilogarithmic graph
- signal graph
- signal-flow graph
- signed graph
- signed labeled graph
- singular graph
- spanning graph
- stacked column graph
- star graph
- state graph
- strongly cyclically closed graph
- strongly cyclic edge connected graph
- subdivision graph
- symmetric graph
- total graph
- transaction graph
- transition graph
- transitive graph
- transmission graph
- tripartite graph
- two-dimensional lattice graph
- two-partite graph
- undirected graph
- unicyclic graph
- vertex critical graph
- vertical bar graph
- x-y graph -
10 graph
1) граф2) график; кривая || строить график; вычерчивать кривую3) диаграмма || представлять в виде диаграммы4) вчт. моносимвольная графема, граф•- alternating graph
- alternating-composition graph
- animated bar graph
- area graph
- associated undirected graph
- atomic graph
- attachment graph
- balanced signed graph
- bar graph
- basis graph
- bicolorable graph
- bicolored graph
- bipartite graph
- block graph
- bunch graph
- Cayley's graph
- circuit closed graph
- circuit connected graph
- circuit-free graph
- clique graph
- color graph
- colored graph
- column graph
- columnar graph
- communication graph
- complete graph
- connected graph
- converse graph
- coordinate graph
- critical graph
- current graph
- cyclic graph
- data flow graph
- Desargues' graph
- descendence graph
- directed graph
- dual Y-axis graph
- Euler graph
- Eulerian graph
- even graph
- exclusion graph
- exploded pie graph
- finite graph
- flat graph
- fractal graph
- function graph
- fuzzy graph
- general graph
- graceful graph
- graph of contiguous channels
- graph of strictly partial order
- Hamilton graph
- Hamiltonian graph
- high/low/close/open graph
- HLCO graph
- horizontal bar graph
- identity graph
- implication graph
- infinite graph
- interaction graph
- interchange graph
- interval graph
- isomorphic graph
- k-chromatic graph
- k-colorable graph
- k-edge connected graph
- knot graph
- labeled graph
- labeled semantic graph
- levelized graph
- line graph
- line-symmetric graph
- linked pie-column graph
- lobe graph
- locally finite graph
- locally restricted graph
- logarithmic graph
- l-vertex connected graph
- maximal strongly singular graph
- mixed column/line graph
- mixed graph
- m-partite graph
- multidimensional graph
- mutually connected graph
- net graph
- network graph
- nonseparable graph
- numbered undirected graph
- one hundred percent column graph
- one-way graph
- operator graph
- oriented graph
- paired bar graph
- paired pie graph
- Pappus' graph
- Petersen graph
- phonetic graph
- picture graph
- pie graph
- planar graph
- plane graph
- point-symmetric graph
- proportional pie graph
- recursively structured graph
- reduced-flow graph
- region adjacency graph
- regular graph of degree n
- reproduction graph
- R-graph
- rigid circuit graph
- rooted graph
- scatter graph
- sectional graph
- self-complementary graph
- selt-negational signed graph
- semilogarithmic graph
- signal graph
- signal-flow graph
- signed graph
- signed labeled graph
- singular graph
- spanning graph
- stacked column graph
- star graph
- state graph
- strongly cyclic edge connected graph
- strongly cyclically closed graph
- subdivision graph
- symmetric graph
- total graph
- transaction graph
- transition graph
- transitive graph
- transmission graph
- tripartite graph
- two-dimensional lattice graph
- two-partite graph
- undirected graph
- unicyclic graph
- vertex critical graph
- vertical bar graph
- x-y graphThe New English-Russian Dictionary of Radio-electronics > graph
-
11 graph
nounграф mbinding number of а graph число m связности графаcircumference of а graph окружность f графаgenus of а graph род m графаgraph coloring раскраска f графаgraph rewrite system система f переписи графовjoin of graphs соединение m графовlabelling of а graph разметка f графаniche graph граф-ниша fАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > graph
-
12 graph
1) график; диаграмма; кривая; номограмма2) граф3) лингв. вариант графемы•- acyclic graph
- alternating graph
- AND-OR graph
- bar graph - bipartite graph
- bunch graph
- Caley graph
- circuit-free graph
- circulant graph
- circular graph
- closed graph
- color graph
- complementary graph
- complete graph
- computation graph
- connected graph
- connectivity graph
- control flow graph
- data flow program graph
- data-flow graph - directed graph
- E-graph
- extremal graph
- finite graph
- flat graph
- flow graph
- game graph
- harward graph
- indirected graph
- infinite graph
- information graph
- irregular graph
- labeled graph
- line graph
- linear graph
- locally finite graph
- marked points graph
- monochromatic graph
- multidimensional graph
- N-chromatic graph
- network graph
- net graph
- node-symmetric graph
- object graph
- ordered graph
- oriented graph
- pattern graph
- planar graph
- processing graph
- product graph
- regular graph of degree N
- regular graph
- scene graph
- section graph
- signal-flow graph
- singular graph
- software graph
- spectral decision graph
- stacked bar graph
- stacked graph
- state graph
- strongly connected graph
- task graph
- total graph
- transaction graph
- transition graph
- tree graph
- two-dimensional graph
- undirected graph
- vertex-weighted graph
- weighted directed graph
- word graphEnglish-Russian dictionary of computer science and programming > graph
-
13 graph
1. n график, диаграмма, номограмма; криваяcomputation graph — вычислительный граф; граф вычислений
2. n мат. лингв. графgraph features — свойства графа; теоретико-графовые свойства
product graph — произведение графов; граф-произведение
singular graph — сингулярный граф; вырожденный граф
3. v изображать диаграммой; чертить графики4. v разг. размножать, копировать с помощью гектографаСинонимический ряд:1. chart (noun) bar chart; blueprint; chart; design; diagram; flow chart; linear representation; map; picture; pie chart; plot; table2. diagram (verb) diagram; draw; outline; trace -
14 graph
1. график2. диаграмма; графикcomputation graph — вычислительный граф; граф вычислений
3. чертить графикsingular graph — сингулярный граф; вырожденный граф
regular graph — однородный граф; регулярный граф
-
15 graph
1. график, диаграммаcomputation graph — вычислительный граф; граф вычислений
2. графgraph features — свойства графа; теоретико-графовые свойства
product graph — произведение графов; граф-произведение
singular graph — сингулярный граф; вырожденный граф
3. гидрограф -
16 вершинно связный граф
Большой англо-русский и русско-английский словарь > вершинно связный граф
-
17 articulation point
точка сочленения, точка разрыва [графа], разрезающая вершинавершина связанного графа, удаление которой (и инцидентных ей рёбер) делает граф несвязанным.Syn:см. тж. connected graphАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > articulation point
См. также в других словарях:
K-vertex-connected graph — In graph theory, a graph G with vertex set V(G) is said to be k vertex connected (or k connected) if G setminus X is connected for all X subseteq V(G) with left| X ight| < k. In plain English, a graph is k connected if the graph remains connected … Wikipedia
K-edge-connected graph — In graph theory, a graph G with edge set E(G) is said to be k edge connected if G setminus X is connected for all X subseteq E(G) with left| X ight| < k. In plain English, a graph is k edge connected if the graph remains connected when you delete … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Vertex (graph theory) — For other uses, see Vertex (disambiguation). A graph with 6 vertices and 7 edges where the vertex number 6 on the far left is a leaf vertex or a pendant vertex In graph theory, a vertex (plural vertices) or node is the fundamental unit out of… … Wikipedia
Graph toughness — In graph theory, toughness is a measure of the connectivity of a graph. A graph G is said to be t tough if, for every k > 1, G cannot be split into k different connected components by the removal of fewer than tk vertices. For instance, a graph… … Wikipedia
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
Graph of groups — In geometric group theory, a graph of groups is an object consisting of a collection of groups indexed by the vertices and edges of a graph, together with a family of injective homomorphisms of the edge groups into the vertex groups.There is a… … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Coxeter graph — This article is about the 3 regular graph. For the graph associated with a Coxeter group, see Coxeter diagram. Coxeter graph The Coxeter graph Vertices 28 Edges 42 … Wikipedia
Biconnected graph — In the mathematical discipline of graph theory, a biconnected graph is a connected graph with no articulation vertices.In other words, a biconnected graph is nonseparable, meaning if any vertex were to be removed, the graph will remain… … Wikipedia